Recursive and nonextendible functions over the reals; filter foundation for recursive analysis.II
نویسندگان
چکیده
منابع مشابه
Analog computers and recursive functions over the reals
In this paper we show that Shannon’s General Purpose Analog Computer (GPAC) is equivalent to a particular class of recursive functions over the reals with the flavour of Kleene’s classical recursive function theory. We first consider the GPAC and several of its extensions to show that all these models have drawbacks and we introduce an alternative continuous-time model of computation that solve...
متن کاملReal Recursive Functions and Real Extensions of Recursive Functions
Recently, functions over the reals that extend elementarily computable functions over the integers have been proved to correspond to the smallest class of real functions containing some basic functions and closed by composition and linear integration. We extend this result to all computable functions: functions over the reals that extend total recursive functions over the integers are proved to...
متن کاملA foundation for real recursive function theory
The class of recursive functions over the reals, denoted by REC(R), was introduced by Cristopher Moore in his seminal paper written in 1995. Since then many subsequent investigations brought new results: the class REC(R) was put in relation with the class of functions generated by the General Purpose Analogue Computer of Claude Shannon; classical digital computation was embedded in several ways...
متن کاملTcs Technical Report Learning Recursive Functions Learning Recursive Functions
Studying the learnability of classes of recursive functions has attracted considerable interest for at least four decades. Starting with Gold’s (1967) model of learning in the limit, many variations, modifications and extensions have been proposed. These models differ in some of the following: the mode of convergence, the requirements intermediate hypotheses have to fulfill, the set of allowed ...
متن کاملPrimitive recursive selection functions for existential assertions over abstract algebras
We generalize to abstract many-sorted algebras the classical proof-theoretic result due to Parsons, Mints and Takeuti that an assertion ∀x ∃yP (x, y) (where P is Σ01), provable in Peano arithmetic withΣ 1 induction, has a primitive recursive selection function. This involves a corresponding generalization to such algebras of the notion of primitive recursiveness . The main difficulty encountere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1999
ISSN: 0168-0072
DOI: 10.1016/s0168-0072(98)00048-7